Formalising Generalised Substitutions
نویسنده
چکیده
We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe the model of computation implicit in this theory and show how this is based on a compound monad, and we contrast this model of computation and monad with those implicit in Dunne’s theory of abstract commands. Subject to a qualification concerning frames, we prove, using the Isabelle/HOL theorem prover, that Dunne’s results about generalised substitutions follow from the model of computation which we describe.
منابع مشابه
0 Work It , Wrap It , Fix It , Fold It
The worker/wrapper transformation is a general-purpose technique for refactoring recursive programs to improve their performance, without compromising their correctness. The two previous approaches to formalising the technique were based upon different recursion operators, and different correctness conditions. In this article we show how these two approaches can be generalised in a uniform mann...
متن کاملCalculi of Generalised -Reduction and Explicit Substitutions: The Type Free and Simply Typed Versions
Extending the-calculus with either explicit substitution or generalised reduction has been the subject of extensive research recently and still has many open problems. This paper is the rst investigation into the properties of a calculus combining both generalised reduction and explicit substitutions. We present a calculus, gs, that combines a calculus of explicit substitution, s, and a calculu...
متن کاملDelayed Substitutions
This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. In this approach, substitutions are delayed (but not executed) explicitly. We implement this idea with two calculi, one where substitution is a primitive construction of the calculus, the other where substitutions is represented...
متن کاملGeneralised -reduction and Explicit Substitutions 8th International Conference on Programming
Extending the-calculus with either explicit substitution or generalised reduction has been the subject of extensive research recently which still has many open problems. Due to this reason, the properties of a calculus combining both generalised reduction and explicit substitutions have never been studied. This paper presents such a calculus sg and shows that it is a desirable extension of the-...
متن کامل1 Work It , Wrap It , Fix It , Fold It ( Extended
The worker/wrapper transformation is a general-purpose technique for refactoring recursive programs to improve their performance. The two previous approaches to formalising the technique were based upon different recursion operators and different correctness conditions. In this article we show how these two approaches can be generalised in a uniform manner by combining their correctness conditi...
متن کامل